|
課程名稱 |
自動機與形式語言
Formal Languages and Automata Theory |
|
開課學期 |
111-1 |
|
授課對象 |
資訊工程學系 |
|
授課教師 |
陳偉松 |
|
課號 |
CSIE3110 |
|
課程識別碼 |
902E43500 |
|
班次 |
02 |
|
學分 |
3.0 |
|
全/半年 |
半年 |
|
必/選修 |
必帶 |
|
上課時間 |
星期一3,4,5(10:20~13:10) |
|
上課地點 |
資104 |
|
備註 |
本課程以英語授課。
限本系所學生(含輔系、雙修生) 且 限學士班三年級以上 且 限學號雙號
總人數上限：80人 |
|
|
|
|
課程簡介影片 |
|
|
核心能力關聯 |
核心能力與課程規劃關聯圖 |
|
課程大綱
|
|
為確保您我的權利,請尊重智慧財產權及不得非法影印
|
|
課程概述 |
待補 |
|
課程目標 |
待補 |
|
課程要求 |
待補 |
|
預期每週課後學習時數 |
|
|
Office Hours |
另約時間 備註： TA mailing list: automata@csie.ntu.edu.tw
TA hour:
呂佳軒 (Lu Chia-Hsuan), r09922064@ntu.edu.tw, r09922064@csie.ntu.edu.tw, TA hour: Thursday, 13:00-14:00, room 401.
呂侑承 (Lu Yu-Cheng), r10922030@ntu.edu.tw, r10922030@csie.ntu.edu.tw, TA hour: Tuesday, 14:00-15:00, room 401.
陳翰霆 (Chen Han-Ting), r10922073@ntu.edu.tw, r10922073@csie.ntu.edu.tw, TA hour: Wednesday, 14:30, room 401.
陳法熏 (Chen Fa-Hsun), r10944015@ntu.edu.tw, r10944015@csie.ntu.edu.tw, TA hour: Wednesday, 10:30-11:30, room 401. |
|
指定閱讀 |
|
|
參考書目 |
待補 |
|
評量方式
(僅供參考) |
|
|
針對學生困難提供學生調整方式 |
|
上課形式 |
以錄影輔助 |
|
作業繳交方式 |
|
|
考試形式 |
|
|
其他 |
由師生雙方議定 |
|
|
週次 |
日期 |
單元主題 |
|
Week 1 |
9/5 |
Lesson 0. Preliminaries: Review of basic facts from discrete mathematics and an example of problem impossible for computer program. |
|
Week 2 |
9/12 |
Lesson 1. Finite state automata: Deterministic and non-deterministic finite state automata, closure properties and pumping lemma. |
|
Week 3 |
9/19 |
Lesson 2. Regular expressions: The notion of regular expressions and their equivalence with finite state automata. |
|
Week 4 |
9/26 |
Lesson 3. Context free languages: Context-free grammars, closure properties, relation with regular languages and pumping lemma. |
|
Week 5 |
10/3 |
Lesson 4. Push-down automata: Push-down automata and their equivalence with context-free grammars |
|
Week 6 |
10/10 |
National day (Holiday) |
|
Week 7 |
10/17 |
Review week |
|
Week 8 |
10/24 |
Midterm exam |
|
Week 9 |
10/31 |
Lesson 5. Turing machines and decidable languages: The notion of Turing machines, recognizable and decidable langauges and their closure properties. |
|
Week 10 |
11/7 |
Lesson 6. Turing machines and the notion of algorithms: Some variants of Turing machines, Church-Turing thesis: The equivalence between Turing machines and C++ programs. |
|
Week 11 |
11/14 |
Lesson 7. Universal Turing machines and the halting problem: The notion of Universal Turing machines and some examples of undecidable languages. |
|
Week 12 |
11/21 |
Lesson 8. Reducibility: Mapping reductions and Turing reductions as a tool to prove undecidablity |
|
Week 13 |
11/28 |
Lesson 9. Non-deterministic Turing machines: The notion of non-deterministic Turing machines and the equivalence with deterministic Turing machines. |
|
Week 14 |
12/5 |
Lesson 10. Basic complexity classes: The class L, NL, P, NP and PSPACE and the relations between them. |
|
Week 15 |
12/12 |
Review week |
|
Week 16 |
12/19 |
Final exam |
|